Detection of Multiple Bottleneck Bandwidth

نویسندگان

  • Niwat Thepvilojanapong
  • Yoshito Tobe
  • Kaoru Sezaki
چکیده

This paper endeavors to present a scheme to detect and estimate bottleneck bandwidth along the path in the Internet. We have participated in the RIPE NCC’s TTM project to perform one-way delay (OWD) and loss measurement from a host in our laboratory to other hosts in Europe and USA. TTM is an active measurement system, which has implemented the IPPM one-way delay (RFC2679) and one-way loss metrics (RFC2680). From measured delay, loss, and traceroute’s data, we can know the path properties such as bandwidth, path rerouting, congestion between each host, and so on. Based on measured delay, we propose an algorithm, called Estimating Bottleneck Bandwidth using Packet-pair (EBBP), to estimate bottleneck bandwidth. Our algorithm is based on Bolot’s equation, but we use OWD instead of round trip delay. Every participated host uses GPS receiver to avoid the problem of clock difference. We make phase plot graph from measured delay, extract useful samples, quantize extracted samples, and find intercept of phase plot graph by EBBP. Finally, we can estimate bottleneck bandwidth along the path.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Approach for Bottleneck Resource(s) Detection Problem in the Multi-objective Dynamic Job Shop Environments

Nowadays energy saving is one of the crucial aspects in decisions. One of the approaches in this case is efficient use of resources in the industrial systems. Studies in real manufacturing systems indicating that one or more machines may also act as the Bottleneck Resource/ Resources (BR). On the other hand according to the Theory of Constraints (TOC), the efficient use of resources in manufact...

متن کامل

Solving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm

The problem of Dynamic Job Shop (DJS) scheduling is one of the most complex problems of machine scheduling. This problem is one of NP-Hard problems for solving which numerous heuristic and metaheuristic methods have so far been presented. Genetic Algorithms (GA) are one of these methods which are successfully applied to these problems. In these approaches, of course, better quality of solutions...

متن کامل

Solving product mix problem in multiple constraints environment using goal programming

The theory of constraints is an approach to production planning and control that emphasizes on the constraints to increase throughput by effectively managing constraint resources. One application in theory of constraints is product mix decision. Product mix influences the performance measures in multi-product manufacturing system. This paper presents an alternative approach by using of goal pro...

متن کامل

Probabilistic Packet Scheduling: Achieving Proportional Share Bandwidth Allocation

This paper describes and evaluates a probabilistic packet scheduling algorithm for providing different level of service for TCP flows. With our approach, each router in the network defines its currency in terms of ticket, and assigns tickets to its inputs based on contractual agreements with its upstream routers. A flow is tagged with tickets to represent the relative share of bandwidth it shou...

متن کامل

Bandwidth and Delay Optimization by Integrating of Software Trust Estimator with Multi-User Cloud Resource Competence

Trust Establishment is one of the significant resources to enhance the scalability and reliability of resources in the cloud environment. To establish a novel trust model on SaaS (Software as a Service) cloud resources and to optimize the resource utilization of multiple user requests, an integrated software trust estimator with multi-user resource competence (IST-MRC) optimization mechanism is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003